Deciding deadlock-freedom of daisy-chain protocols by fair reachability analysis
نویسندگان
چکیده
A relief strategy called fair reachability analysis [5, 7, 11] is extended for the verification of daisy-chain protocols, which are defined in the communicating finite state machine model as networks of n ≥ 2 processes with a bidirectional, serial link structure. Fair reachability analysis is shown to decide the deadlock detection problem for daisy-chain protocols whose fair reachable global state space is finite. A sufficient condition for this finiteness is also given.
منابع مشابه
Deadlock Detection by Pair Reachability Analysis: From Cyclic to Multi-Cyclic Protocols (and Beyond?)
In this paper, we generalize the technique of fair reachability analysis to multi-cyclic protocols modeled as networks of communicating nite state machines, where a number of cyclic protocols are interconnected in such a way that any two component cyclic protocols share at most one process and each channel in the protocol belongs to exactly one component cyclic protocol. By composing the fair r...
متن کاملDeadlock detection by fair reachability analysis: multi-cyclic protocols and beyond
Fair reachability analysis is generalized to multi-cyclic protocols defined in the communicating finite state machine model as networks of n ≥ 2 processes with a multiple unidirectional ring topology and with arbitrary process structures. As a result, the deadlock detection problem is shown to be decidable for multi-cyclic protocols whose fair reachable global state space is finite. A sufficien...
متن کاملOn improving simultaneous reachability analysis for the efficient verification of deadlock-freedom
In [11], simultaneous reachability analysis is proposed as a relief strategy for the verification of progress properties of bounded protocols. A bounded protocol i s defined as a network of n ≥ 2 finite-state processes communicating over bounded, error-free simplex channels. This paper presents an enhancement of simultaneous reachability analysis which yields a significant reduction of the stor...
متن کاملTighter Reachability Criteria for Deadlock-Freedom Analysis
We combine a prior incomplete deadlock-freedom-checking approach with two new reachability techniques to create a more precise deadlock-freedom-checking framework for concurrent systems. The reachability techniques that we propose are based on the analysis of individual components of the system; we use static analysis to summarise the behaviour that might lead components to this system state, a...
متن کاملHierarchy - Based Incremental Deadlock Detection for
In this paper, we consider communication protocols modeled as sets of communicating finite state machines (CFSM) with synchronous communication. For a set M of CFSMs, reachability analysis of M is to derive a composite CFSM describing the behavior of M and verify safety properties such as freedom from deadlocks or livelocks. The conventional approach to reachability analysis of M is to compose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995